Can quantum cryptography imply quantum mechanics? reply to Smolin
نویسندگان
چکیده
Clifton, Bub, and Halvorson (CBH) have argued that quantum mechanics can be derived from three cryptographic, or broadly information-theoretic, axioms. But Smolin disagrees, and he has given a toy theory that he claims is a counterexample. Here we show that Smolin’s toy theory violates an independence condition for spacelike separated systems that was assumed in the CBH argument. We then argue that any acceptable physical theory should satisfy this independence condition.
منابع مشابه
Can quantum cryptography imply quantum mechanics?
It has been suggested that the ability of quantum mechanics to allow secure distribution of secret key together with its inability to allow bit commitment or communicate superluminally might be sufficient to imply the rest of quantum mechanics. I argue using a toy theory as a counterexample that this is not the case. I further discuss whether an additional axiom (key storage) brings back the qu...
متن کاملThe early days of experimental quantum cryptography
This paper describes the first quantum cryptography experiment, performed at the IBM Thomas J. Watson Research Center in the summer of 1989 by Charles H. Bennett and the author. The apparatus and some of the lesser-known details of the experiment are illustrated and discussed, and quantum cryptography is discussed in the light of some of the more recent research. Also included as an appendix is...
متن کاملLoop Quantum Gravity: Lee Smolin [2
LEE SMOLIN, a theoretical physicist, is concerned with quantum gravity,"the name we give to the theory that unifies all the physics now under construction." More specifically, he is a co-inventor of an approach called loop quantum gravity. In 2001, he became a founding member and research physicist of the Perimeter Institute for Theoretical Physics, in Waterloo, Ontario. Smolin is the author of...
متن کاملApproximate quantum error correction, random codes, and quantum channel capacity
We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This result is then used to analyze the average error correcting performance of codes that are randomly drawn from unitarily invariant code ensembles. Our results co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information & Computation
دوره 5 شماره
صفحات -
تاریخ انتشار 2005